437A - The Child and Homework - CodeForces Solution


implementation *1300

Please click on ads to support us..

C++ Code:

#include<iostream>
#include<vector>
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
int main(){
    string a,b,c,d;
    cin>>a>>b>>c>>d;
    vector<pair<int,char>> v;
    v.push_back(make_pair(a.length()-2,'A'));
    v.push_back(make_pair(b.length()-2,'B'));
    v.push_back(make_pair(c.length()-2,'C'));
    v.push_back(make_pair(d.length()-2,'D'));
    sort(v.begin(),v.end());
    vector<char> ans;
    //for(int i=0;i<3;i++){
      //  if(ans.size()<=1)
   //{ 
    if((2*v[0].first)<=v[1].first){
        ans.push_back(v[0].second);
    }
    if( (2*v[2].first)<=v[3].first){
     ans.push_back(v[3].second);
    }
    if(ans.size()==1){
        cout<<ans[0];
    }
    else{
        cout<<"C";
    }
    return 0;

    //}
    }


Comments

Submit
0 Comments
More Questions

1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array
6. Zigzag Conversion
1612B - Special Permutation
1481. Least Number of Unique Integers after K Removals
1035. Uncrossed Lines
328. Odd Even Linked List
1219. Path with Maximum Gold